A Graph Representation for Two-Dimensional Finite Type Constrained Systems
نویسندگان
چکیده
The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be because there are no graph representations discovered so far. In this paper, we focus on a two-dimensional finite type constrained system, a set of two-dimensional blocks characterized by a finite number of two-dimensional constraints, and propose its graph representation. We then show how to generate an element of the two-dimensional finite type constrained system from the graph representation.
منابع مشابه
Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملThe Decomposition Theorem For Two-Dimensional Shifts Of Finite Type
A one-dimensional shift of finite type can be described as the collection of bi-infinite “walks” along an edge graph. The Decomposition Theorem states that every conjugacy between two shifts of finite type can be broken down into a finite sequence of splittings and amalgamations of their edge graphs. When dealing with two-dimensional shifts of finite type, the appropriate edge graph description...
متن کاملMechanical behaviour of motion for the two-dimensional monolayer system
In this paper we study the dynamics of the 2D-motion of a particle of monolayer. First we consider the usual physical time component and the plan manifold R2, having the polar coordinates. Then a geometric approach to nonholonomic constrained mechanical systems is applied to a problem from the two dimensional geometric dynamics of the Langmuir-Blodgett monolayer. We consider a constraint sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1602.00446 شماره
صفحات -
تاریخ انتشار 2016